167 research outputs found
Optimal design and quantum benchmarks for coherent state amplifiers
We establish the ultimate quantum limits to the amplification of an unknown
coherent state, both in the deterministic and probabilistic case, investigating
the realistic scenario where the expected photon number is finite. In addition,
we provide the benchmark that experimental realizations have to surpass in
order to beat all classical amplification strategies and to demonstrate genuine
quantum amplification. Our result guarantees that a successful demonstration is
in principle possible for every finite value of the expected photon number.Comment: 5 + 8 pages, published versio
Recommended from our members
Property Testing of Boolean Function
The field of property testing has been studied for decades, and Boolean functions are among the most classical subjects to study in this area.
In this thesis we consider the property testing of Boolean functions: distinguishing whether an unknown Boolean function has some certain property (or equivalently, belongs to a certain class of functions), or is far from having this property. We study this problem under both the standard setting, where the distance between functions is measured with respect to the uniform distribution, as well as the distribution-free setting, where the distance is measured with respect to a fixed but unknown distribution.
We obtain both new upper bounds and lower bounds for the query complexity of testing various properties of Boolean functions:
- Under the standard model of property testing, we prove a lower bound of \Omega(n^{1/3}) for the query complexity of any adaptive algorithm that tests whether an n-variable Boolean function is monotone, improving the previous best lower bound of \Omega(n^{1/4}) by Belov and Blais in 2015. We also prove a lower bound of \Omega(n^{2/3}) for adaptive algorithms, and a lower bound of \Omega(n) for non-adaptive algorithms with one-sided errors that test unateness, a natural generalization of monotonicity. The latter lower bound matches the previous upper bound proved by Chakrabarty and Seshadhri in 2016, up to poly-logarithmic factors of n.
- We also study the distribution-free testing of k-juntas, where a function is a k-junta if it depends on at most k out of its n input variables. The standard property testing of k-juntas under the uniform distribution has been well understood: it has been shown that, for adaptive testing of k-juntas the optimal query complexity is \Theta(k); and for non-adaptive testing of k-juntas it is \Theta(k^{3/2}). Both bounds are tight up to poly-logarithmic factors of k. However, this problem is far from clear under the more general setting of distribution-free testing. Previous results only imply an O(2^k)-query algorithm for distribution-free testing of k-juntas, and besides lower bounds under the uniform distribution setting that naturally extend to this more general setting, no other results were known from the lower bound side. We significantly improve these results with an O(k^2)-query adaptive distribution-free tester for k-juntas, as well as an exponential lower bound of \Omega(2^{k/3}) for the query complexity of non-adaptive distribution-free testers for this problem. These results illustrate the hardness of distribution-free testing and also the significant role of adaptivity under this setting.
- In the end we also study distribution-free testing of other basic Boolean functions. Under the distribution-free setting, a lower bound of \Omega(n^{1/5}) was proved for testing of conjunctions, decision lists, and linear threshold functions by Glasner and Servedio in 2009, and an O(n^{1/3})-query algorithm for testing monotone conjunctions was shown by Dolev and Ron in 2011. Building on techniques developed in these two papers, we improve these lower bounds to \Omega(n^{1/3}), and specifically for the class of conjunctions we present an adaptive algorithm with query complexity O(n^{1/3}). Our lower and upper bounds are tight for testing conjunctions, up to poly-logarithmic factors of n
Comparison of the Forest Tenure in Brazil and China
Brazil and China both have extensive forest areas in the world, making important contribution to reversal of the worldwide decline in forest. And as the world’s leading importers and exporters of timber and timber-based products, sustainable forest management for both countries are crucial for global economy and environment, so there is an intense international interest in their sustainability and well-being. Tenure arrangements functioned as powerful tools of forest policy, is not only important for economic growth, social cohesion, poverty reduction and environmental protection - it is also essential for climate change mitigation. This paper is to present and analyze the state of forest tenure in Brazil and China; then followed by a brief comparison of these two countries in terms of changing trends and reform impacts; Furthermore, it identifies some of the main challenges to the reform and points our several opportunities for extending the future forest tenure reform especially for mitigating climate change, and finally making a conclusion to widen the reach of local community tenure and to deepen the exercise of tenure rights
Coordinating a multi-retailer decentralized distribution system with random demand based on buyback and compensation contracts
Purpose: The purpose of this paper is to set up the coordinating mechanism for a
decentralized distribution system consisting of a manufacturer and multiple independent
retailers by means of contracts. It is in the two-stage supply chain system that all retailers sell an
identical product made by the manufacturer and determine their order quantities which directly
affect the expected profit of the supply chain with random demand.
Design/methodology/approach: First comparison of the optimal order quantities in the
centralized and decentralized system shows that the supply chain needs coordination. Then the
coordination model is given based on buyback cost and compensation benefit. Finally the
coordination mechanism is set up in which the manufacturer as the leader uses a buyback policy
to incentive these retailers and the retailers pay profit returns to compensate the manufacturer.
Findings: The results of a numerical example show that the perfect supply chain coordination
and the flexible allocation of the profit can be achieved in the multi-retailer supply chain by the
buyback and compensation contracts.
Research limitations: The results based on assumptions might not completely hold in practice
and the paper only focuses on studying a single product in two-stage supply chain Practical implications: The coordination mechanism is applicable to a realistic supply chain
under a private information setting and the research results is the foundation of further
developing the coordination mechanism for a realistic multi-stage supply chain system with
more products.
Originality/value: This paper focused on studying the coordination mechanism for a
decentralized multi-retailer supply chain by the joint application of the buyback and
compensation contracts. Furthermore the perfect supply chain coordination and the flexible
allocation of the profit are achieved.Peer Reviewe
H2TF for Hyperspectral Image Denoising: Where Hierarchical Nonlinear Transform Meets Hierarchical Matrix Factorization
Recently, tensor singular value decomposition (t-SVD) has emerged as a
promising tool for hyperspectral image (HSI) processing. In the t-SVD, there
are two key building blocks: (i) the low-rank enhanced transform and (ii) the
accompanying low-rank characterization of transformed frontal slices. Previous
t-SVD methods mainly focus on the developments of (i), while neglecting the
other important aspect, i.e., the exact characterization of transformed frontal
slices. In this letter, we exploit the potentiality in both building blocks by
leveraging the \underline{\bf H}ierarchical nonlinear transform and the
\underline{\bf H}ierarchical matrix factorization to establish a new
\underline{\bf T}ensor \underline{\bf F}actorization (termed as H2TF). Compared
to shallow counter partners, e.g., low-rank matrix factorization or its convex
surrogates, H2TF can better capture complex structures of transformed frontal
slices due to its hierarchical modeling abilities. We then suggest the
H2TF-based HSI denoising model and develop an alternating direction method of
multipliers-based algorithm to address the resultant model. Extensive
experiments validate the superiority of our method over state-of-the-art HSI
denoising methods
Coordinating a multi-retailer decentralized distribution system with random demand based on buyback and compensation contracts
Purpose: The purpose of this paper is to set up the coordinating mechanism for a
decentralized distribution system consisting of a manufacturer and multiple independent
retailers by means of contracts. It is in the two-stage supply chain system that all retailers sell an
identical product made by the manufacturer and determine their order quantities which directly
affect the expected profit of the supply chain with random demand.
Design/methodology/approach: First comparison of the optimal order quantities in the
centralized and decentralized system shows that the supply chain needs coordination. Then the
coordination model is given based on buyback cost and compensation benefit. Finally the
coordination mechanism is set up in which the manufacturer as the leader uses a buyback policy
to incentive these retailers and the retailers pay profit returns to compensate the manufacturer.
Findings: The results of a numerical example show that the perfect supply chain coordination
and the flexible allocation of the profit can be achieved in the multi-retailer supply chain by the
buyback and compensation contracts.
Research limitations: The results based on assumptions might not completely hold in practice
and the paper only focuses on studying a single product in two-stage supply chain Practical implications: The coordination mechanism is applicable to a realistic supply chain
under a private information setting and the research results is the foundation of further
developing the coordination mechanism for a realistic multi-stage supply chain system with
more products.
Originality/value: This paper focused on studying the coordination mechanism for a
decentralized multi-retailer supply chain by the joint application of the buyback and
compensation contracts. Furthermore the perfect supply chain coordination and the flexible
allocation of the profit are achieved.Peer Reviewe
- …